Heterogeneous and Asynchronous Networks of Timed Systems
نویسندگان
چکیده
We present a component algebra and an associated logic for heterogenous timed systems. The components of the algebra are asynchronous networks of processes that abstract the behaviour of machines that execute according to the clock granularity of the network node in which they are placed and communicate asynchronously with machines at other nodes. The main novelty of our theory is that not all network nodes need to have the same clock granularity: we investigate conditions under which we can guarantee, a priori, that any interconnections generated at run time through dynamic binding of machines with different clock granularities leads to a consistent orchestration of the whole system. Finally, we investigate which logics can support specifications for this component algebra.
منابع مشابه
Asynchronous Communication Mechanisms Permit the Implementation of Data Interfaces between Heterogeneously Timed Entities at Various Hardware
Practical examples of systems with heterogeneous timing requirements include the embedded real-time control and decisionmaking systems used in aerospace, automotive, and telecommunication applications. It is attractive to construct such systems as digital networks with inherent heterogeneous timing conditions. In these hets (short for heterogeneously timed nets), computational elements interact...
متن کاملDisTriB: Distributed Trust Management Model Based on Gossip Learning and Bayesian Networks in Collaborative Computing Systems
The interactions among peers in Peer-to-Peer systems as a distributed collaborative system are based on asynchronous and unreliable communications. Trust is an essential and facilitating component in these interactions specially in such uncertain environments. Various attacks are possible due to large-scale nature and openness of these systems that affects the trust. Peers has not enough inform...
متن کاملDisTriB: Distributed Trust Management Model Based on Gossip Learning and Bayesian Networks in Collaborative Computing Systems
The interactions among peers in Peer-to-Peer systems as a distributed collaborative system are based on asynchronous and unreliable communications. Trust is an essential and facilitating component in these interactions specially in such uncertain environments. Various attacks are possible due to large-scale nature and openness of these systems that affects the trust. Peers has not enough inform...
متن کاملOn the Possibility of Consensus in Asynchronous Systems
We demonstrate that the leader election and consensus problems are solvable in a timed asynchronous distributed system provided a majority of processes are always eventually able to communicate in a timely manner for a su ciently long time. Failures and recoveries a ecting the other processes and the communications between them do not prevent consensus. The timed asynchronous system model descr...
متن کاملDALD:-Distributed-Asynchronous-Local-Decontamination Algorithm in Arbitrary Graphs
Network environments always can be invaded by intruder agents. In networks where nodes are performing some computations, intruder agents might contaminate some nodes. Therefore, problem of decontaminating a network infected by intruder agents is one of the major problems in these networks. In this paper, we present a distributed asynchronous local algorithm for decontaminating a network. In mos...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 663 شماره
صفحات -
تاریخ انتشار 2014